Convergence analysis of a proximal point algorithm for minimizing differences of functions
نویسندگان
چکیده
منابع مشابه
Convergence of a Proximal Point Algorithm for Solving Minimization Problems
We introduce and consider a proximal point algorithm for solving minimization problems using the technique of Güler. This proximal point algorithm is obtained by substituting the usual quadratic proximal term by a class of convex nonquadratic distance-like functions. It can be seen as an extragradient iterative scheme. We prove the convergence rate of this new proximal point method under mild a...
متن کاملW-convergence of the proximal point algorithm in complete CAT(0) metric spaces
In this paper, we generalize the proximal point algorithm to complete CAT(0) spaces and show that the sequence generated by the proximal point algorithm $w$-converges to a zero of the maximal monotone operator. Also, we prove that if $f: Xrightarrow ]-infty, +infty]$ is a proper, convex and lower semicontinuous function on the complete CAT(0) space $X$, then the proximal...
متن کاملRelatively Inexact Proximal Point Algorithm and Linear Convergence Analysis
Based on a notion of relatively maximal m -relaxed monotonicity, the approximation solvability of a general class of inclusion problems is discussed, while generalizing Rockafellar’s theorem 1976 on linear convergence using the proximal point algorithm in a real Hilbert space setting. Convergence analysis, based on this newmodel, is simpler and compact than that of the celebrated technique of R...
متن کاملErgodic convergence of a stochastic proximal point algorithm
The purpose of this paper is to establish the almost sure weak ergodic convergence of a sequence of iterates (xn) given by xn+1 = (I + λnA(ξn+1, . )) (xn) where (A(s, . ) : s ∈ E) is a collection of maximal monotone operators on a separable Hilbert space, (ξn) is an independent identically distributed sequence of random variables on E and (λn) is a positive sequence in l\l. The weighted average...
متن کاملA Proximal Point Algorithm for Finding a Common Zero of a Finite Family of Maximal Monotone Operators
In this paper, we consider a proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in real Hilbert spaces. Also, we give a necessary and sufficient condition for the common zero set of finite operators to be nonempty, and by showing that in this case, this iterative sequence converges strongly to the metric projection of some point onto the set of c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 2016
ISSN: 0233-1934,1029-4945
DOI: 10.1080/02331934.2016.1253694